Constraint logic programming: a survey

Constraint Logic Programming: A Survey

D Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in different areas of applications. In this survey of CLP, a primary goal is to give a systematic descrip...

J LOGIC PROGRAMMING to appear Constraint Logic Programming A Survey

Machine This section discusses some major issues in the design of an abstract machine for the execution of CLP programs The primary focus here will be on the design of the instruction set with emphasis on the interaction between their use and information obtained from a potential program analyzer Some elements of the runtime structure will also be mentioned In general the essential features of ...

Constraint Logic Programming

Interval Constraint Logic Programming

In this paper, we present a n o verview on the use of interval arithmetic to process numerical constraints in Constraint Logic Programming. The main principle is to approximate n-ary relations over R I with Cartesian products of intervals whose bounds are taken in a nite subset of R I. V ariables represent real values whose domains are intervals deened in the same manner. Narrowing operators ar...

Coinductive Constraint Logic Programming

Constraint logic programming (CLP) has been proposed as a declarative paradigm for merging constraint solving and logic programming. Recently, coinductive logic programming has been proposed as a powerful extension of logic programming for handling (rational) infinite objects and reasoning about their properties. Coinductive logic programming does not include constraints while CLP’s declarative...